Probabilistic analysis of column-convex and directed diagonally-convex animals

نویسنده

  • Guy Louchard
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polyominoes with Nearly Convex Columns: an Undirected Model

Column-convex polyominoes were introduced in 1950’s by Temperley, a mathematical physicist working on “lattice gases”. By now, column-convex polyominoes are a popular and well-understood model. There exist several generalizations of column-convex polyominoes. However, the enumeration by area has been done for only one of the said generalizations, namely for multi-directed animals. In this paper...

متن کامل

The Number of Line-Convex Directed Polyominoes Having the Same Orthogonal Projections

The number of line-convex directed polyominoes with given horizontal and vertical projections is studied. It is proven that diagonally convex directed polyominoes are uniquely determined by their orthogonal projections. The proof of this result is algorithmical. As a counterpart, we show that ambiguity can be exponential if antidiagonal convexity is assumed about the polyomino. Then, the result...

متن کامل

Hermite-Hadamard inequalities for $mathbb{B}$-convex and $mathbb{B}^{-1}$-convex functions

Hermite-Hadamard inequality is one of the fundamental applications of convex functions in Theory of Inequality. In this paper, Hermite-Hadamard inequalities for $mathbb{B}$-convex and $mathbb{B}^{-1}$-convex functions are proven.

متن کامل

Bernstein's polynomials for convex functions and related results

In this paper we establish several polynomials similar to Bernstein's polynomials and several refinements of  Hermite-Hadamard inequality for convex functions.

متن کامل

A method for the enumeration of various classes of column-convex polygons

2 Abstract. We present a new method that allows to enumerate various classes of column-convex polygons, according to their perimeter and their area. The rst step of this method leads to a functional equation which deenes implicitly the generating function of the class under consideration. The second step consists in solving this equation. We apply systematically our method to all the usual clas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Random Struct. Algorithms

دوره 15  شماره 

صفحات  -

تاریخ انتشار 1997